A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM

Two solvable cases of the Traveling Salesman Problem

In the Euclidean Traveling Salesman Problem, a set of points in the plane is given, and we look for a shortest closed curve through these lines (a \tour"). We treat two special cases of this problem which are solvable in polynomial time. The rst solvable case is the N-line Traveling Salesman Problem, where the points lie on a small number (N) of parallel lines. Such problems arise for example i...

Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

in press. 17 H and L chain preparations in 1 M propionic acid were mixed in the ratio of 3: 1 based on O.D. and then dialyzed against cold water followed by borate buffer. 18 This arc was not apparent in the plate of the original y-globulin nor in any of the other plates. It did not appear when the horse anti-rabbit globulin was absorbed with normal rabbit 72-globulin prior to diffusion. Since ...

The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case

We solve the special case of the Euclidean Traveling Salesman Problem where II m cities lie on the boundary of the convex hull of all n cities, and the other m cities lie on a line segment inside this convex hull by an algorithm which needs O(mn) time and O(n) space.

Traveling Salesman Problem: The Human Case

In the field of human cognition, performance and optimization behavior in the TSP has mainly been investigated by means of visual versions in which humans are confronted with a number of dots on a computer monitor. Their task is to connect these dots by a straight line such that the resulting path is optimal with respect to overall length. Path planning tasks similar to the TSP are quite common...

The traveling salesman problem